Divisible Load Scheduling with Multiple Sources: Closed Form Solutions
نویسندگان
چکیده
Closed form solutions for optimal finish time and job allocation are largely obtained only for network topologies with a single load originating (root) processor. However, it often happens that load can be generated from multiple sources as in large-scale data intensive problems with geographically distributed resources. This paper introduces load scheduling strategy for tree networks with two load originating processors. A unique scheduling strategy that allows one to obtain closed form solutions for the optimal finish time and load allocation for each processor in the network is proposed.
منابع مشابه
Grid scheduling divisible loads from two sources
To date closed form solutions for optimal finish time and job allocation are largely obtained only for network topologies with a single load originating (root) processor. However in large-scale data intensive problems with geographically distributed resources, load is generated from multiple sources. This paper introduces a new divisible load scheduling strategy for single level tree networks w...
متن کاملClosed form Solution for Scheduling Arbitrarily Divisible Load Model in Data Grid Applications: Multiple Sources
Scheduling an application in data grid was significantly complex and very challenging because of its heterogeneous in nature of the grid system. When the Divisible Load Theory (DLT) model had emerged as a powerful model for modeling data-intensive grid problem, Task Data Present (TDP) model was proposed based on it. This study presented a new Adaptive TDP (ATDP) for scheduling the intensive gri...
متن کاملGrid Scheduling Divisible Loads from Multiple Sources via Linear Programming
To date solutions for optimal finish time and job allocation in divisible load theory are largely obtained only for network topologies with a single load originating (root) processor. However in large-scale data intensive problems with geographically distributed resources, load is generated from multiple sources. This paper introduces a new divisible load scheduling strategy for tree networks w...
متن کاملTowards Optimal Performance in Distributed Memory Systems with Buffer Constraints Using Divisible Load Analysis
This chapter investigates scheduling a divisible task in distributed memory systems with finite-size buffer constraints. Two types of network topologies are considered: a single-level tree network and a m-dimensional hypercube network. First, this chapter presents the closed-form solutions for the case with infinite-size buffers. Based on these solutions, an iterative strategy, referred to as I...
متن کاملNew Optimal Load Allocation for Scheduling Divisible Data Grid Applications
In many data grid applications, data can be decomposed into multiple independent sub-datasets and distributed for parallel execution and analysis. This property has been successfully employed by using Divisible Load Theory (DLT), which has been proved as a powerful tool for modeling divisible load problems in data-intensive grid. There are some scheduling models have been studied but no optimal...
متن کامل